Graph Transformation and AI Planning

نویسندگان

  • Stefan Edelkamp
  • Arend Rensink
چکیده

This document provides insight to the similarities and differences of Graph Transformation and AI Planning, two rising research fields with different publication organs and tools. While graph transformation systems can be used as a graphical knowledge engineering front-end for designing planning problems, AI planning technology (especially heuristic search) can accelerate the exploration process in graph transformation benchmarks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

PDDL Planning Problems and GROOVE Graph Transformations: Combining two Worlds with a Translator

This paper describes how the AI planning language PDDL was combined with a graph-based model checking tool called GROOVE. Graph-based models are very intuitive to work with, yet powerful enough to deal with a great variety of problems. The visual representation provides a quick insight in the workings of a model and the available tools allows the user to explore the system with great ease. The ...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

Any-Angle Path Planning

In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous ...

متن کامل

Real Time Planning for Path-finding in Computer Games

The relationship between AI and computer games could be qualified as “bi-directional inverse”. Modern AI techniques use old games –chess, bridge, go, etc..as test fields while modern computer games use old AI techniques as A*. The fast evolution of this kind of entertainment has multiplied the AI requirements of the new developments evidencing the necessity to reuse the work already done in the...

متن کامل

Spatial Transformation of Apartment-Type Housing Buildings (Case S tudy: Gaziantep, Turkey)Turkey

The aims of this s tudy is to analyse the planning and design process, basic principles and thechange-transformation process of the apartment type residential buildings in Turkey, Gaziantep city based on his torical background. The scope of the research consis ts of residential buildings built in the city of Gaziantep, which were built in the pos t-Republican period. In addition, s tate-b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007